On self-dual codes over some prime fields

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On self-dual codes over some prime fields

In this paper, we study self-dual codes over GF(p) where p = 11, 13, 17, 19, 23 and 29. A classification of such codes for small lengths is given. The largest minimum weights of these codes are investigated. Many maximum distance separable self-dual codes are constructed.

متن کامل

Repeated-Root Self-Dual Negacyclic Codes over Finite Fields

Let Fq be a finite field with q = p , where p is an odd prime. In this paper, we study the repeated-root self-dual negacyclic codes over Fq. The enumeration of such codes is investigated. We obtain all the self-dual negacyclic codes of length 2p over Fq, a ≥ 1. The construction of self-dual negacyclic codes of length 2bp over Fq is also provided, where gcd(2, b) = gcd(b, p) = 1 and a ≥ 1.

متن کامل

New MDS Self-Dual Codes over Large Finite Fields

We construct MDS Euclidean and Hermitian self-dual codes over large finite fields of odd and even characteristics. Our codes arise from cyclic and negacyclic duadic codes. ∗Faculty of Mathematics USTHB, University of Sciences and Technology of Algiers, B.P 32 El Alia, Bab Ezzouar, Algiers, Algeria

متن کامل

Enumeration of Self-Dual Cyclic Codes of some Specific Lengths over Finite Fields

Self-dual cyclic codes form an important class of linear codes. It has been shown that there exists a self-dual cyclic code of length n over a finite field if and only if n and the field characteristic are even. The enumeration of such codes has been given under both the Euclidean and Hermitian products. However, in each case, the formula for selfdual cyclic codes of length n over a finite fiel...

متن کامل

On self-dual codes over F5

The purpose of this paper is to improve the upper bounds of the minimum distances of self-dual codes over F5 for lengths 22, 26, 28, 32 − 40. In particular, we prove that there is no [22, 11, 9] self-dual code over F5, whose existence was left open in 1982. We also show that both the Hamming weight enumerator and the Lee weight enumerator of a putative [24, 12, 10] self-dual code over F5 are un...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2003

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(02)00520-4